Indirect Estimation of Shortest Path Distributions with Small-World Experiments
نویسنده
چکیده
The distribution of shortest path lenghts is a useful characterisation of the connectivity in a network. The small-world experiment is a classical way to study the shortest path distribution in real-world social networks that cannot be directly observed. However, the data observed in these experiments are distorted by two factors: attrition and routing (in)efficiency. This leads to inaccuracies in the estimates of shortest path lenghts. In this paper we propose a model to analyse small-world experiments that corrects for both of the aforementioned sources of bias. Under suitable circumstances the model gives accurate estimates of the true underlying shortest path distribution without directly observing the network. It can also quantify the routing efficiency of the underlying population. We study the model by using simulations, and apply it to real data from previous small-world experiments.
منابع مشابه
Shortest Path Problem with Gamma Probability Distribution Arc Length
We propose a dynamic program to find the shortest path in a network having gamma probability distributions as arc lengths. Two operators of sum and comparison need to be adapted for the proposed dynamic program. Convolution approach is used to sum two gamma probability distributions being employed in the dynamic program.
متن کاملAn Estimation of the Shortest and Largest Average Path Length in Graphs of Given Density
Many real world networks (graphs) are observed to be ’small worlds’, i.e., the average path length among nodes is small. On the other hand, it is somewhat unclear what other average path length values networks can produce. In particular, it is not known what the maximum and the minimum average path length values are. In this paper we provide a lower estimation for the shortest average path leng...
متن کاملDistributed Geometric Distance Estimation in Ad Hoc Networks
Localization of nodes in ad hoc networks is an essential step in many applications. A major task when localizing nodes is to accurately estimate distances. So far, distance estimation is often based on counting the minimum number of nodes on the shortest routing path (hop count) and presuming a fixed width for one hop. This is prone to error as the length of one hop can vary significantly. The ...
متن کاملA New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets
A shortest path problem is a practical issue in networks for real-world situations. This paper addresses the fuzzy shortest path (FSP) problem to obtain the best fuzzy path among fuzzy paths sets. For this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (IFSs) in order to determine the fuzzy shortest path. Moreover, this algorithm is developed for ...
متن کاملFinding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014